package ivia.fiuza.primenumbers.classes;

public class PrimeNumber {

	public boolean isPrime( int number ) {
		int diviserCounter = 0;

		for( int counter = 1; counter <= number; counter++ ){
			if( ( number % counter ) == 0 ){
				diviserCounter++;
			}
		}

		return ( diviserCounter == 2 ? true : false );
	}
}
